Approximation algorithms for treewidth
ثبت نشده
چکیده
j k a l m ` n c n o b p q o ` a r s t c u v w b m a l x ` y w b a l o ` m x n u o ` a w d l c ` a m d v c x o n b w Y u o x z { l o n b w Y u o x m ` a w | k s a l o q m k k m k v n b w Y c Y m u m a t w y c a t n o w y ` a w d l c ` a m d n b w d o ` ` q l o b o a b c k ` m a m w k ` c b o n c b a m c u u t d w k a b w u u o s Y t a q w n u c t o b ` z X ` m x n u o ` a w d l c ` a m d v c x o m ` c b o ` a b m d a m w k w y a l o v o k o b c u ` a w d l c ` a m d v c x o m k a b w s r d o s Y t } l c n u o t ~ m k z X u a l w r v l a l m ` n b w Y u o x m ` k w q k a w Y o m k d w w k s w k ~ p k w c u v w b m a l x y w b a l o n b w Y u o x m ` k w q k a w b r k m k n w u t k w x m c u a m x o z o d w k o d a r b o a l c a a l o n b w Y u o x …
منابع مشابه
Approximation algorithms for digraph width parameters
Treewidth of an undirected graph measures how close the graph is to being a tree. Several problems that are NP-hard on general graphs are solvable in polynomial time on graphs with bounded treewidth. Motivated by the success of treewidth, several directed analogues of treewidth have been introduced to measure the similarity of a directed graph to a directed acyclic graph (DAG). Directed treewid...
متن کاملApproximation algorithms for classes of graphs excluding single-crossing graphs as minors
Many problems that are intractable for general graphs allow polynomial-time solutions for structured classes of graphs, such as planar graphs and graphs of bounded treewidth. In this paper, we demonstrate structural properties of larger classes of graphs and show how to exploit the properties to obtain algorithms. The classes considered are those formed by excluding as a minor a graph that can ...
متن کاملLosing Treewidth by Separating Subsets
We study the problem of deleting the smallest set S of vertices (resp. edges) from a given graph G such that the induced subgraph (resp. subgraph) G \ S belongs to some class H. We consider the case where graphs in H have treewidth bounded by t, and give a general framework to obtain approximation algorithms for both vertex and edge-deletion settings from approximation algorithms for certain na...
متن کاملA ck n 5-Approximation Algorithm for Treewidth
We give an algorithm that for an input n-vertex graph G and integer k > 0, in time O(cn) either outputs that the treewidth of G is larger than k, or gives a tree decomposition of G of width at most 5k + 4. This is the first algorithm providing a constant factor approximation for treewidth which runs in time single-exponential in k and linear in n. Treewidth based computations are subroutines of...
متن کاملImproved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth
In this paper we present two novel generic schemes for approximation algorithms for optimization NP-hard graph problems constrained to partial k-trees. Our first scheme yields deterministic polynomialtime algorithms achieving typically an approximation factor of k/ log n, where k = polylog(n). The second scheme yields randomized polynomialtime algorithms achieving an approximation factor of k/ ...
متن کاملApproximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
Various parameters of graphs connected to sparse matrix factoriza-tion and other applications can be approximated using an algorithm of Leighton et al. that nds vertex separators of graphs. The approximate values of the parameters, which include minimum front size, treewidth, pathwidth, and minimum elimination tree height, are no more than O(logn) (minimum front size and treewidth) and O(log 2 ...
متن کامل